
//  4、10、股票、33、34
public class Test1 {
    public int tribonacci(int n) {
        //1. 创建dp表
        //2. 初始化
        //3. 填表
        //4. 返回值
        if (n == 0) return 0;
        if (n == 1 || n == 2) return 1;
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = dp[2] = 1;
        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }
        return dp[n];
    }

    public static void main(String[] args) {
        Test1 test1 = new Test1();
        System.out.println(test1.tribonacci(10));
    }
}
